An O(log n) Randomized Resource Discovery Algorithm
نویسنده
چکیده
The problem of a distributed network of computers discovering one another by making network connections is called the resource discovery problem. In this paper, we present the first randomized algorithm, called ‘Absorption’, that can solve the resource discovery problem in O(log n) running time with high probability and with O(n2) expected pointer complexity. In particular, the expected running time of our Absorption algorithm is at most 4 log4/3 n + 1 steps on any strongly-connected network. We also describe a variation of the algorithm, which runs in O(log n) expected time but has O(n) expected message complexity.
منابع مشابه
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain this element as well as query a set to know the elements. We want to find a small set-cover using a minimal number of such queries. We present a Monte Carlo randomized algorithm that approximates an optimal set-cover o...
متن کاملThe k -Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotic...
متن کاملThe Covert Set Cover Problem with Applications to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain this element as well as query a set to know the elements. We want to find a small set-cover using a minimal number of such queries. We present a Monte Carlo randomized algorithm that approximates an optimal set-cover o...
متن کاملResource Minimization Job Scheduling
Given a set J of jobs, where each job j is associated with release date rj , deadline dj and processing time pj , our goal is to schedule all jobs using the minimum possible number of machines. Scheduling a job j requires selecting an interval of length pj between its release date and deadline, and assigning it to a machine, with the restriction that each machine executes at most one job at any...
متن کاملNetwork Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q ⊆ V of queries in an undirected graph G = (V,E) such that these queries discover all edges and non-edges of the graph. This is motivated by the common approach of combining local measurements in order to obtain maps of the Internet or other dynamically growing networks. In the distance query model, a query at node q return...
متن کامل